WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(1, 6)
  "cons" :: ["A"(1, 6) x "A"(1, 6)] -(1)-> "A"(1, 6)
  "cons" :: ["A"(10, 6) x "A"(10, 6)] -(10)-> "A"(10, 6)
  "f" :: ["A"(0, 8)] -(12)-> "A"(0, 0)
  "g" :: ["A"(1, 6)] -(0)-> "A"(15, 6)
  "h" :: ["A"(10, 6)] -(4)-> "A"(8, 8)
  "s" :: ["A"(0, 8)] -(8)-> "A"(0, 8)
  "s" :: ["A"(0, 6)] -(6)-> "A"(1, 6)
  "s" :: ["A"(0, 6)] -(6)-> "A"(15, 6)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "cons" :: ["A"_cf(3, 0) x "A"_cf(3, 0)] -(3)-> "A"_cf(3, 0)
  "cons" :: ["A"_cf(1, 0) x "A"_cf(1, 0)] -(1)-> "A"_cf(1, 0)
  "f" :: ["A"_cf(0, 0)] -(1)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(4, 0)
  "h" :: ["A"_cf(3, 0)] -(1)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(6, 0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"cons\"_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(0, 1) x "A"(0, 1)] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1)